Derivable Nets1)
نویسندگان
چکیده
منابع مشابه
Derivable Type Classes
Generi programming allows you to write a fun tion on e, and use it many times at di erent types. A lot of good foundational work on generi programming has been done. The goal of this paper is to propose a pra ti al way of supporting generi programming within the Haskell language, without radi ally hanging the language or its type system. The key idea is to present generi programming as a ri her...
متن کاملClosed Non-derivable Itemsets
Itemset mining typically results in large amounts of redundant itemsets. Several approaches such as closed itemsets, non-derivable itemsets and generators have been suggested for losslessly reducing the amount of itemsets. We propose a new pruning method based on combining techniques for closed and non-derivable itemsets that allows further reductions of itemsets. This reduction is done without...
متن کاملLeft derivable or Jordan left derivable mappings on Banach algebras
Let $mathcal{A}$ be a unital Banach algebra, $mathcal{M}$ be a left $mathcal{A}$-module, and $W$ in $mathcal{Z}(mathcal{A})$ be a left separating point of $mathcal{M}$. We show that if $mathcal{M}$ is a unital left $mathcal{A}$-module and $delta$ is a linear mapping from $mathcal{A}$ into $mathcal{M}$, then the following four conditions are equivalent: (i) $delta$ is a Jordan left de...
متن کاملSome Easily Derivable Integer Sequences
We propose and discuss several simple ways of obtaining new enumerative sequences from existing ones. For instance, the number of graphs considered up to the action of an involutory transformation is expressible as the semi-sum of the total number of such graphs and the number of graphs invariant under the involution. Another, less familiar idea concerns evenand odd-edged graphs: the difference...
متن کاملMining Non-Derivable Association Rules
Association rule mining typically results in large amounts of redundant rules. We introduce efficient methods for deriving tight bounds for confidences of association rules, given their subrules. If the lower and upper bounds of a rule coincide, the confidence is uniquely determined by the subrules and the rule can be pruned as redundant, or derivable, without any loss of information. Experimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 1965
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-1965-043-1